Acceleration of a Preconditioning Method for Ill-Conditioned Dense Linear Systems by Use of a BLAS-based Method

نویسندگان

  • Yuka Kobayashi
  • Takeshi Ogita
  • Katsuhisa Ozaki
چکیده

We are interested in accurate numerical solutions of ill-conditioned linear systems using floating-point arithmetic. Recently, we proposed a preconditioning method to reduce the condition numbers of coefficient matrices. The method utilizes an LU factorization obtained in working precision arithmetic and requires matrix multiplication in quadruple precision arithmetic. In this note, we aim to accelerate the preconditioning method from a practical point of view. For this purpose, we apply a more efficient method of accurate matrix multiplication based on BLAS in the preconditioning method. We demonstrate excellent performance of the BLAS-based preconditioning method by numerical experiments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming

 Abstract  We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

Robust Preconditioning of Large, Sparse, Symmetric Eigenvalue Problems

Iterative methods for solving large, sparse, symmetric eigenvalue problems often encounter convergence diiculties because of ill-conditioning. The Generalized Davidson method is a well known technique which uses eigenvalue preconditioning to surmount these diiculties. Preconditioning the eigenvalue problem entails more subtleties than for linear systems. In addition, the use of an accurate conv...

متن کامل

On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization

For many important real world problems, after the application of appropriate discretization techniques we can get symmetric and relatively dense linear systems of equations (e.g. those obtained by collocation or projection-like discretization of first kind integral equations). Usually, these systems are rankdefficient and (very) ill-conditioned, thus classical direct or iterative solvers can no...

متن کامل

A Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems

We consider the solution of ill-conditioned symmetric and positive definite large sparse linear systems of equations. These arise, for instance, when using some symmetrizable preconditioning technique for solving a general (possibly unsymmetric) ill-conditioned linear system, or in domain decomposition of a numerically difficult elliptic problem. We are also concerned with the consecutive solut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017